package top.humbleyuan.test.meituan;

import java.math.BigDecimal;
import java.text.DecimalFormat;
import java.util.Scanner;

/**
 * @Author HumbleYuan
 * @Date 2020/3/26 18:32
 * @Des
 */
public class MeiTuan_3_26 {
    public static void main(String[] args) {
        //first();

        //second();
        third();
    }

    /**
     * 一个序列是有趣的需要满足：当且仅当这个序列的每一个元素ai 满足 i 整除ai 。
     *
     * 现在给定一个长度为n的数组，问这个数组有多少个非空的子序列是有趣的，由于答案可能比较大，
     * 只需要输出在模998244353意义下答案的就行了。
     *
     * 一个长度为n的数组的非空子序列定义为从这个数组中移除至多n-1个元素后剩下的元素有序按照原顺序形成的数组。
     * 比如说对于数组[3,2,1]，它的非空子序列有[3],[2],[1],[3,2],[3,1],[2,1],[3,2,1]。
     */
    private static void third() {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNext()) {
            int num = sc.nextInt();
            int[] nums = new int[num];
            for (int i = 0; i < num; i++) {
                nums[i] = sc.nextInt();
            }


        }
        sc.close();
    }

    private static void second() {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNext()) {
            int cNum = sc.nextInt();
            int[] r = new int[cNum];
            for (int i = 0; i < cNum; i++) {
                r[i] = sc.nextInt();
            }

            if(cNum == 0) {
                System.out.println(0.00000);
                continue;
            }

            double sum = 0d;
            for (int i = cNum - 1; i >= 0; i -= 2) {
                if(i == 0) {
                    sum += r[i] * r[i] * Math.PI;
                    break;
                }
                sum += Math.PI * (r[i] * r[i] - r[i - 1] * r[i - 1]);
            }
            BigDecimal bd = new BigDecimal(sum).setScale(5, BigDecimal.ROUND_HALF_UP);
            System.out.println(bd.toString());
        }

        sc.close();
    }

    private static void first() {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            char[] num = sc.nextLine().toCharArray();
            //String[] transfers = sc.nextLine().split(" ");
            int[] transfers = new int[9];

            for (int i = 0; i < 9; i++) {
                transfers[i] = sc.nextInt();
            }

            if(num == null || num.length == 0) {
                System.out.println("");
                continue;
            }

            int p;
            String res = "";
            if (num[0] == '-') {
                p = 1;
                res += '-';
            } else {
                p = 0;
            }


            for (; p < num.length; p++) {
                res  += transfers[num[p] - '1'];
            }

            System.out.println(res);


        }

        sc.close();
    }
}
